Asymptotic Approximation of Optimal Portfolio for Small Time Horizons
نویسندگان
چکیده
منابع مشابه
Optimal Portfolio Selection with Transaction Costs and Finite Horizons
We examine the optimal trading strategy for a CRRA investor who maximizes the expected utility of wealth on a finite date and faces transaction costs. Closed-form solutions are obtained when this date is uncertain. We then show a sequence of analytical solutions converge to the solution to the problem with a deterministic finite horizon. Consistent with the common life-cycle investment advice, ...
متن کاملThe structure of optimal portfolio strategies for continuous time markets
The paper studies problem of continuous time optimal portfolio selection for a diffusion model of incomplete market. It is shown that, under some mild conditions, the suboptimal strategies for investors with different performance criterions can be constructed using a limited number of fixed processes (mutual funds), for a market with a larger number of available risky stocks. In other words, a ...
متن کاملContinuous Time Mean-Variance Optimal Portfolio Allocation
5 We present efficient partial differential equation (PDE) methods for continuous time mean6 variance portfolio allocation problems when the underlying risky asset follows a jump-diffusion. 7 The standard formulation of mean-variance optimal portfolio allocation problems, where the 8 total wealth is the underlying stochastic process, gives rise to a one-dimensional (1-D) non-linear 9 Hamilton-J...
متن کاملOptimal portfolio in a continuous - time self
This paper discusses an optimal portfolio selection problem in a continuous-time economy, where the price dynamics of a risky asset are governed by a continuous-time self-exciting threshold model. This model provides a way to describe the effect of regime switching on price dynamics via the selfexciting threshold principle. Its main advantage is to incorporate the regime switching effect withou...
متن کاملAn Asymptotic Fully Polynomial Time Approximation Scheme for Bin Covering
In the bin covering problem there is a group L=(a1; : : : ; an) of items with sizes s̃(ai)∈ (0; 1), and the goal is to 6nd a packing of the items into bins to maximize the number of bins that receive items of total size at least 1. This is a dual problem to the classical bin packing problem. In this paper we present the 6rst asymptotic fully polynomial-time approximation scheme for the problem. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Financial Mathematics
سال: 2018
ISSN: 1945-497X
DOI: 10.1137/17m1111371